Routing in Hypercycles. Deadlock Free and Backtracking Strategies
نویسندگان
چکیده
Hypercycles. is a class of multidimensional graphs, which are generalizations of the n-cube. They are obtained by allowing each dimension to incoIporate more than two elements and a cyclic interconnection strategy. Hypercycles, can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. Routing strategies, including deadlock-free and deadlock-avoiding have been developed and their relative perfonnance established through simulations.
منابع مشابه
Deadlock-preventing routing in hypercycles Routage empechant les impasses lors d'hypercycles
Hypercycles make up a class of multidimensional graphs obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of graphs of varying size. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically t...
متن کاملA 1.2 Jlm CMOS DEADLOCK-FREE ROUTER FOR HYPERCYCLE NETWORKS
It has been shown in [8,9] that the e-cube or priorIn this work, we consider deadlock-free routing in Hyitized dimension routing for hypercubes is deadlock free percycles which are class of multidimensional graphs since the resources are ordered and there are no cycles. In used for modeling interconnection networks. Hypercyecube, a lower order link cannot be issued unless a higher cles offer si...
متن کاملA New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
Second generation multicomputers use wormhole routing, allowing a very low channel setup time and drastically reducing the dependency between network latency and internode distance. Deadlock-free routing strategies have been developed, allowing the implementation of fast hardware routers that reduce the communicat ion bottleneck. Also, adaptive routing algorithms with deadlock-avoidance or dead...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملEffective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks
The InfiniBand Architecture (IBA) defines a switchbased network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular, which complicates routing and deadlock avoidance. Current routing algorithms for NOWs, either achieve a low network performance, such as the up*/down* routing scheme, or cannot be implemented on IBA ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992